Kirillov's Unimodality Conjecture for the Rectangular Narayana Polynomials
نویسندگان
چکیده
منابع مشابه
Kirillov's Unimodality Conjecture for the Rectangular Narayana Polynomials
In the study of Kostka numbers and Catalan numbers, Kirillov posed a unimodality conjecture for the rectangular Narayana polynomials. We prove that the rectangular Narayana polynomials have only real zeros, and thereby confirm Kirillov’s unimodality conjecture. By using an equidistribution property between descent numbers and ascent numbers on ballot paths due to Sulanke and a bijection between...
متن کاملIndependence polynomials of well-covered graphs: Generic counterexamples for the unimodality conjecture
A graph G is well-covered if all its maximal stable sets have the same size, denoted by α(G) (M. D. Plummer, 1970). If sk denotes the number of stable sets of cardinality k in graph G, and α(G) is the size of a maximum stable set, then I(G;x) = α(G) ∑ k=0 skx k is the independence polynomial of G (I. Gutman and F. Harary, 1983). J. I. Brown, K. Dilcher and R. J. Nowakowski (2000) conjectured th...
متن کاملThe Real-rootedness of Generalized Narayana Polynomials
Abstract. In this paper, we prove the real-rootedness of two classes of generalized Narayana polynomials: one arising as the h-polynomials of the generalized associahedron associated to the finite Weyl groups, the other arising in the study of the infinite log-concavity of the Boros-Moll polynomials. For the former, Brändén has already proved that these hpolynomials have only real zeros. We est...
متن کاملSign-Graded Posets, Unimodality of W-Polynomials and the Charney-Davis Conjecture
We generalize the notion of graded posets to what we call sign-graded (labeled) posets. We prove that the W -polynomial of a sign-graded poset is symmetric and unimodal. This extends a recent result of Reiner and Welker who proved it for graded posets by associating a simplicial polytopal sphere to each graded poset. By proving that the W -polynomials of sign-graded posets has the right sign at...
متن کاملCounting Lattice Paths by Narayana Polynomials
Let d(n) count the lattice paths from (0, 0) to (n, n) using the steps (0,1), (1,0), and (1,1). Let e(n) count the lattice paths from (0, 0) to (n, n) with permitted steps from the step set N × N − {(0, 0)}, where N denotes the nonnegative integers. We give a bijective proof of the identity e(n) = 2n−1d(n) for n ≥ 1. In giving perspective for our proof, we consider bijections between sets of la...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2018
ISSN: 1077-8926
DOI: 10.37236/6806